#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

int ans[2], n, pot[110], top;

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	n = in;
	rep(i, 1, n) {
		int s = in, t = s / 2;
		rep(i, 1, s) {
			int k = in;
			if(i <= t) ans[0] += k;
			else if(i >= s - t + 1) ans[1] += k;
			else pot[++top] = k;
		}
	} sort(pot + 1, pot + top + 1, greater < int >());
	rep(i, 1, top) if(i & 1) ans[0] += pot[i]; else ans[1] += pot[i];
	printf("%d %d\n", ans[0], ans[1]);
	return 0;
}
